Complete Congruence Representations with 2-distributive Modular Lattices
نویسنده
چکیده
In 1990, we published the following result: Let m be a regular cardinal > א0. Every m-algebraic lattice L can be represented as the lattice of m-complete congruence relations of an m-complete modular lattice K. In this note, we present a short proof of this theorem. In fact, we present a significant improvement: The lattice K we construct is 2-distributive.
منابع مشابه
locally modular lattices and locally distributive lattices
A locally modular (resp. locally distributive) lattice is a lattice with a congruence relation and each of whose equivalence class has sufficiently many elements and is a modular (resp. distributive) sublattice. Both the lattice of all closed subspaces of a locally convex space and the lattice of projections of a locally finite von Neumann algebra are locally modular. The lattice of all /^-topo...
متن کاملRepresentations of Join-homomorphisms of Distributive Lattices with Doubly 2-distributive Lattices
In the early eighties, A. Huhn proved that if D, E are finite distributive lattices and ψ : D → E is a {0}-preserving join-embedding, then there are finite lattices K, L and there is a lattice homomorphism φ : K → L such that ConK (the congruence lattice of K) is isomorphic to D, ConL (the congruence lattice of L) is isomorphic to E, and the natural induced mapping extφ : ConK → ConL represents...
متن کاملDistributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کاملFinitely Based Modular Congruence Varieties Are Distributive
R. Dedekind introduced the modular law, a lattice equation true in most of the lattices associated with classical algebraic systems, see [4]. Although this law is one of the most important tools for working with these lattices, it does not fully describe the equational properties of these lattices. This was made clear in [8] where B. Jónsson and the author showed that if any modular congruence ...
متن کاملThe Classification Problem for Graphs and Lattices Is Wild
We prove that the classification problem for graphs and several types of algebraic lattices (distributive, congruence and modular) up to isomorphism contains the classification problem for pairs of matrices up to simultaneous similarity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000